A Fast Algorithm for Long Fir Filters with Small Coefficient Alphabet
نویسندگان
چکیده
This paper presents a fast algorithm for FIR filters with small coefficient alphabet in time domain. Our method outperforms conventional time domain filtering several times in arithmetic complexity in practical applications. It is also competitive with transform domain techniques based on Fast Fourier Transform (FFT). Unlike FFT based methods our approach is accurate and is not using rounding and scaling operations. In addition it is simple to implement.
منابع مشابه
Iterative Algorithms for Multichannel Equalization
A fast iterative algorithm, with computation based on the fast Fourier transform (FFT), is presented. It can be used to control a soundfield at several control points with a loudspeaker array from multiple reference signals. It designs an equalizer able to invert long FIR filters and which achieves better performance than traditionnal FFT-based deconvolution methods with a limited number of coe...
متن کاملOptimal Filter Partitions for Real-time Fir Filtering Using Uniformly-partitioned Fft-based Convolution in the Frequency-domain
This paper concerns highly-efficient real-time FIR filtering with low input-to-output latencies. For this type of application, partitioned frequency-domain convolution algorithms are established methods, combining efficiency and the necessity of low latencies. Frequency-domain convolution realizes linear FIR filtering by means of circular convolution. Therefore, the frequency transform’s period...
متن کاملDesign of IIR Digital Filter using Modified Chaotic Orthogonal Imperialist Competitive Algorithm (RESEARCH NOTE)
There are two types of digital filters including Infinite Impulse Response (IIR) and Finite Impulse Response (FIR). IIR filters attract more attention as they can decrease the filter order significantly compared to FIR filters. Owing to multi-modal error surface, simple powerful optimization techniques should be utilized in designing IIR digital filters to avoid local minimum. Imperialist compe...
متن کاملMultidimensional Multichannel FIR Deconvolution Using GrÖbner Bases
We present a new method for general multidimensional multichannel deconvolution with finite impulse response (FIR) convolution and deconvolution filters using Gröbner bases. Previous work formulates the problem of multichannel FIR deconvolution as the construction of a left inverse of the convolution matrix, which is solved by numerical linear algebra. However, this approach requires the prior ...
متن کاملCoefficient FIR Filters using Fast Simulated Evolutionary Optimization
In this paper we present a new algorithm, fast simulated evolutionary optimization (FSEO), a multi-agent stochastic search method for optimizing the coefficients of digital filters in the signed powers-of-two (SPT) space by minimizing the weighted squared error between discrete filter frequency response and desired frequency response. Unlike conventional methods where each coefficient is alloca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004